High-Level Modelling and Reformulation of Constraint Satisfaction Problems
نویسنده
چکیده
منابع مشابه
Automatable High-Level Integration of Constraint Programs
We propose a reformulation algorithm as well as a set of re-formulation rules for models of constraint satisfaction problems written in our high-level constraint programming language esra, which is more expressive than opl and is compiled into opl. For the class of mapping problems, the reformulation algorithm achieves models that integrate a constraint programming formulation and an integer pr...
متن کاملHigh-Level Reformulation of Constraint Programs
We propose a set of reformulation rules for models of constraint satisfaction problems that are written in our high-level constraint programming language ESRA, which is more expressive than OPL and is compiled into OPL. These automatable rules achieve models that are often very similar to what a human modeller would have tried, such as switching from a pure constraint program to an integer line...
متن کاملInterchangeability Supports Abstraction and Reformulation for Multi-Dimensional Constraint Satisfaction
Interchangeability provides a principled approach to abstraction and reformulation of constraint satisfaction problems. Values are interchangeable if exchanging one for the other in any solution produces another solution. Abstracting a problem by simplifying the constraints can increase interchangeability. Multi-dimensional constraint satisfaction problems can provide natural opportunities for ...
متن کاملConstraint Satisfaction, Databases, and Logic
Constraint satisfaction problems constitute a broad class of algorithmic problems that are ubiquitous in several differ ent areas of artificial intelligence and computer science. In their full generality, constraint satisfaction problems are NP-complete and, thus, presumed to be algorithmically in tractable. To cope with the intractability of these prob lems, researchers have devoted conside...
متن کاملModelling and Reformulating Constraint Satisfaction Problems
The solution density of a constraint problem can have a significant effect on local search performance. This paper describes a reformulation technique for artificially increasing solution density: relaxing the model in such a way that relaxed solutions are dominated by real solutions, and can be transformed into them. On an open stack minimization problem this technique can exponentially increa...
متن کامل